An open queueing network for lead time analysis
نویسندگان
چکیده
منابع مشابه
Queueing Network Modeling and Lead Time Compression of Electronic Procurement
Procurement, i.e., the process of obtaining materials or services and managing their inflow into organizations, is a critical process in supply chain management. Internet technologies offer attractive opportunities to reduce purchasing costs while increasing the speed and efficiency of the procurement process through seamless network integration and automated execution of key tasks. This paper ...
متن کاملLaws of Little in an open queueing network
Abstract. The object of this research in the queueing theory is theorems about the functional strong laws of large numbers (FSLLN) under the conditions of heavy traffic in an open queueing network (OQN). The FSLLN is known as a fluid limit or fluid approximation. In this paper, FSLLN are proved for the values of important probabilistic characteristics of the OQN investigated as well as the virt...
متن کاملOptimal Server Resource Allocation Using an Open Queueing Network Model of Response Time
service level agreement, web performance tuning, software performance modeling, response time, queueing, optimization We present a nonlinear integer optimization model for determining the number of machines at each tier in a multi-tier server network. We utilize a result from an open queueing network model on the average response time; the optimization model is to minimize a weighted sum of tot...
متن کاملModelling complex assemblies as a queueing network for lead time control
In this paper we develop an open queueing network for optimal design of multi-stage assemblies, in which each service station represents a manufacturing or assembly operation. The arrival processes of the individual parts of the product are independent Poisson processes with equal rates. In each service station, there is a server with exponential distribution of processing time, in which the se...
متن کاملAnalysis of an Open Tandem Queueing Network with Population Constraint and Constant Service Times
We consider an open tandem queueing network with population constraint and constant service times. The total number of customers that may be presented in the network can not exceed a given value K. Customers arriving at the queueing network when there are more than K customers are forced to wait in an external queue. The arrival process to the queueing network is assumed to be arbitrary. We sho...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: IIE Transactions
سال: 2002
ISSN: 0740-817X,1545-8830
DOI: 10.1080/07408170208928845